Semi-online scheduling on two uniform processors
نویسندگان
چکیده
منابع مشابه
Semi-online scheduling on two uniform processors
In this paper we consider the problem of semi on-line scheduling on two uniform processors, in the case where the total sum of the tasks is known in advance. Tasks arrive one at a time and have to be assigned to one of the two processors before the next one arrives. The assignment cannot be changed later. The objective is the minimization of the makespan. We derive lower bounds and algorithms, ...
متن کاملTwo semi-online scheduling problems on two uniform machines
This paper considers two semi-online scheduling problems, one with known optimal value and the other with known total sum, on two uniform machines with a machine speed ratio of s ≥ 1. For the first problem, we provide an optimal algorithm for s ∈ [ 1+ √
متن کاملScheduling Complete Intrees on Two Uniform Processors with Communication Delays
In this paper we present an optimal algorithm for scheduling complete k-ary tree on two uniform processors of di erent speeds in order to minimize schedule length. We consider the basic case of unit standard execution times and unit communication times.
متن کاملPreemptive on-line scheduling for two uniform processors
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the processors has speed 1 and the other has speed s¿1. The objective is to minimize the makespan. A best possible algorithm with competitive ratio of (1+s)=(1+s+s) is proposed for this problem. c © 1998 Elsevier Science B.V. All rights reserved.
متن کاملSemi-Online Scheduling on Two Uniform Machines with Known Optimum Part I: Tight Lower Bounds
This problem is about to schedule a number of jobs of different lengths on two uniform machines with given speeds 1 and s ≥ 1, so that the overall completion time, i.e., the makespan, is earliest possible. We consider a semi-online variant (introduced for equal speeds) by Azar and Regev, where the jobs arrive one after the other, while the scheduling algorithm knows the optimum value of the cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.12.005